Sorting and Searching / Collecting Numbers

#include <bits/stdc++.h>
using namespace std;
 
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using isize = ptrdiff_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using usize = size_t;
using f32 = float_t;
using f64 = double_t;
 
inline constexpr i32 Modulus = 1e9 + 7;
 
int main(void)
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
 
    usize n;
    cin >> n;
 
    vector<usize> positions(n + 1);
    for (usize position = 1; position <= n; position += 1)
    {
        usize num;
        cin >> num;
        positions[num] = position;
    }
 
    usize rounds = 1;
    for (usize num = 1; num < n; num += 1)
    {
        if (positions[num] > positions[num + 1])
        {
            rounds += 1;
        }
    }
 
    cout << rounds;
 
    return 0;
}